Decomposition of Multiport Elements in a Revised Multibond Graph Notation
نویسنده
چکیده
Decomposition rules are derived for multiport-transformers, -resistors, -storage elements and -gyrators into land 2-port elements, junctions and bonds. It appears that it is useful to extend the vectorbond, or rather multibond, notation recently proposed by the author with a “multibond array”. Canonical forms are introduced on the basis of minimal realization, because decompositions of multiport elements are not unique. A new type of coupling factor (“directed coupling factor”) is introduced,for multiport-resistors and capacitors.
منابع مشابه
A Note on Revised Szeged Index of Graph Operations
Let $G$ be a finite and simple graph with edge set $E(G)$. The revised Szeged index is defined as $Sz^{*}(G)=sum_{e=uvin E(G)}(n_u(e|G)+frac{n_{G}(e)}{2})(n_v(e|G)+frac{n_{G}(e)}{2}),$ where $n_u(e|G)$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$ and $n_{G}(e)$ is the number of equidistant vertices of $e$ in $G$. In this paper...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملSqueezing as an irreducible resource
Using the Bloch-Messiah reduction we show that squeezing is an “irreducible” resource which remains invariant under transformations by linear optical elements. In particular, this gives a decomposition of any optical circuit with linear input-output relations into a linear multiport interferometer followed by a unique set of single-mode squeezers and then another multiport interferometer. Using...
متن کاملThe Main Eigenvalues of the Undirected Power Graph of a Group
The undirected power graph of a finite group $G$, $P(G)$, is a graph with the group elements of $G$ as vertices and two vertices are adjacent if and only if one of them is a power of the other. Let $A$ be an adjacency matrix of $P(G)$. An eigenvalue $lambda$ of $A$ is a main eigenvalue if the eigenspace $epsilon(lambda)$ has an eigenvector $X$ such that $X^{t}jjneq 0$, where $jj$ is the all-one...
متن کاملOn the revised edge-Szeged index of graphs
The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...
متن کامل